0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_vampire %s %d THM
0.13/0.34	% Computer : n026.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1920
0.13/0.34	% WCLimit    : 240
0.13/0.34	% DateTime   : Wed Jul 30 02:14:34 EDT 2025
0.13/0.34	% CPUTime    : 
0.13/0.36	This is a THF_ problem
0.13/0.37	Running higher-order theorem proving
0.13/0.37	Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.q5tcqzQUFS/E---3.1_30255.p -m 16384 -t 240
0.13/0.40	% (30497)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_30255 for (2399ds/27Mi)
0.13/0.40	% (30498)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_30255 for (2399ds/2Mi)
0.13/0.40	% (30501)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_30255 for (2399ds/18Mi)
0.13/0.40	% (30500)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_30255 for (2399ds/275Mi)
0.13/0.40	% (30498)Instruction limit reached!
0.13/0.40	% (30498)------------------------------
0.13/0.40	% (30498)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.13/0.40	% (30498)Termination reason: Unknown
0.13/0.40	% (30498)Termination phase: shuffling
0.13/0.40	
0.13/0.40	% (30498)Memory used [KB]: 1023
0.13/0.40	% (30498)Time elapsed: 0.003 s
0.13/0.40	% (30498)Instructions burned: 2 (million)
0.13/0.40	% (30498)------------------------------
0.13/0.40	% (30498)------------------------------
0.13/0.40	% (30501)First to succeed.
0.13/0.40	% (30499)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_30255 for (2399ds/2Mi)
0.13/0.40	% (30496)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_30255 for (2399ds/4Mi)
0.13/0.40	% (30499)Instruction limit reached!
0.13/0.40	% (30499)------------------------------
0.13/0.40	% (30499)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.13/0.40	% (30499)Termination reason: Unknown
0.13/0.40	% (30499)Termination phase: Property scanning
0.13/0.40	
0.13/0.40	% (30499)Memory used [KB]: 1023
0.13/0.40	% (30499)Time elapsed: 0.004 s
0.13/0.40	% (30499)Instructions burned: 3 (million)
0.13/0.40	% (30499)------------------------------
0.13/0.40	% (30499)------------------------------
0.13/0.40	% (30495)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_30255 for (2399ds/183Mi)
0.13/0.40	% (30496)Instruction limit reached!
0.13/0.40	% (30496)------------------------------
0.13/0.40	% (30496)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.13/0.40	% (30496)Termination reason: Unknown
0.13/0.40	% (30496)Termination phase: Property scanning
0.13/0.40	
0.13/0.40	% (30496)Memory used [KB]: 1023
0.13/0.40	% (30496)Time elapsed: 0.004 s
0.13/0.40	% (30496)Instructions burned: 4 (million)
0.13/0.40	% (30496)------------------------------
0.13/0.40	% (30496)------------------------------
0.13/0.41	% (30500)Also succeeded, but the first one will report.
0.13/0.41	% (30501)Refutation found. Thanks to Tanya!
0.13/0.41	% SZS status Theorem for E---3.1_30255
0.13/0.41	% SZS output start Proof for E---3.1_30255
0.13/0.41	thf(func_def_0, type, in: $i > ($i > $o) > $o).
0.13/0.41	thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
0.13/0.41	thf(func_def_3, type, emptyset: $i > $o).
0.13/0.41	thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
0.13/0.41	thf(func_def_5, type, singleton: $i > $i > $o).
0.13/0.41	thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
0.13/0.41	thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
0.13/0.41	thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
0.13/0.41	thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
0.13/0.41	thf(func_def_10, type, complement: ($i > $o) > $i > $o).
0.13/0.41	thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
0.13/0.41	thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
0.13/0.41	thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
0.13/0.41	thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
0.13/0.41	thf(func_def_15, type, fun_image: ($i > $i) > ($i > $o) > $i > $o).
0.13/0.41	thf(func_def_16, type, fun_composition: ($i > $i) > ($i > $i) > $i > $i).
0.13/0.41	thf(func_def_17, type, fun_inv_image: ($i > $i) > ($i > $o) > $i > $o).
0.13/0.41	thf(func_def_18, type, fun_injective: ($i > $i) > $o).
0.13/0.41	thf(func_def_19, type, fun_surjective: ($i > $i) > $o).
0.13/0.41	thf(func_def_20, type, fun_bijective: ($i > $i) > $o).
0.13/0.41	thf(func_def_21, type, fun_decreasing: ($i > $i) > ($i > $i > $o) > $o).
0.13/0.41	thf(func_def_22, type, fun_increasing: ($i > $i) > ($i > $i > $o) > $o).
0.13/0.41	thf(func_def_37, type, sK0: $i > $o).
0.13/0.41	thf(func_def_38, type, sK1: $i > $i).
0.13/0.41	thf(func_def_39, type, sK2: $i > $o).
0.13/0.41	thf(f136,plain,(
0.13/0.41	  $false),
0.13/0.41	  inference(avatar_sat_refutation,[],[f125,f130,f135])).
0.13/0.41	thf(f135,plain,(
0.13/0.41	  ~spl3_1),
0.13/0.41	  inference(avatar_contradiction_clause,[],[f134])).
0.13/0.41	thf(f134,plain,(
0.13/0.41	  $false | ~spl3_1),
0.13/0.41	  inference(trivial_inequality_removal,[],[f133])).
0.13/0.41	thf(f133,plain,(
0.13/0.41	  ($true = $false) | ~spl3_1),
0.13/0.41	  inference(backward_demodulation,[],[f108,f132])).
0.13/0.41	thf(f132,plain,(
0.13/0.41	  ((sK2 @ sK5) = $false) | ~spl3_1),
0.13/0.41	  inference(trivial_inequality_removal,[],[f131])).
0.13/0.41	thf(f131,plain,(
0.13/0.41	  (sK4 != sK4) | ((sK2 @ sK5) = $false) | ~spl3_1),
0.13/0.41	  inference(superposition,[],[f121,f107])).
0.13/0.41	thf(f107,plain,(
0.13/0.41	  ((sK1 @ sK5) = sK4)),
0.13/0.41	  inference(equality_proxy_clausification,[],[f106])).
0.13/0.41	thf(f106,plain,(
0.13/0.41	  ($true = ((sK1 @ sK5) = sK4))),
0.13/0.41	  inference(binary_proxy_clausification,[],[f104])).
0.13/0.41	thf(f104,plain,(
0.13/0.41	  ((((sK1 @ sK5) = sK4) & ((sK0 @ sK5) & (sK2 @ sK5))) = $true)),
0.13/0.41	  inference(beta_eta_normalization,[],[f103])).
0.13/0.41	thf(f103,plain,(
0.13/0.41	  (((^[Y0 : $i]: (((sK1 @ Y0) = sK4) & ((sK0 @ Y0) & (sK2 @ Y0)))) @ sK5) = $true)),
0.13/0.41	  inference(sigma_clausification,[],[f102])).
0.13/0.41	thf(f102,plain,(
0.13/0.41	  ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & ((sK0 @ Y0) & (sK2 @ Y0))))) = $true)),
0.13/0.41	  inference(binary_proxy_clausification,[],[f100])).
0.13/0.41	thf(f100,plain,(
0.13/0.41	  (((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & ((sK0 @ Y0) & (sK2 @ Y0))))) => ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK0 @ Y0)))) & (?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK2 @ Y0)))))) = $false)),
0.13/0.41	  inference(beta_eta_normalization,[],[f99])).
0.13/0.41	thf(f99,plain,(
0.13/0.41	  (((^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) = Y0) & ((sK0 @ Y1) & (sK2 @ Y1))))) => ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) = Y0) & (sK0 @ Y1)))) & (?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) = Y0) & (sK2 @ Y1))))))) @ sK4) = $false)),
0.13/0.41	  inference(sigma_clausification,[],[f98])).
0.13/0.41	thf(f98,plain,(
0.13/0.41	  ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) = Y0) & ((sK0 @ Y1) & (sK2 @ Y1))))) => ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) = Y0) & (sK0 @ Y1)))) & (?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) = Y0) & (sK2 @ Y1)))))))) != $true)),
0.13/0.41	  inference(beta_eta_normalization,[],[f97])).
0.13/0.41	thf(f97,plain,(
0.13/0.41	  (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))) @ sK1 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))) @ sK2 @ sK0)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))) @ sK1 @ sK2) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))) @ sK1 @ sK0))) != $true)),
0.13/0.41	  inference(definition_unfolding,[],[f88,f93,f90,f94,f94,f90,f90])).
0.13/0.41	thf(f94,plain,(
0.13/0.41	  (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))),
0.13/0.41	  inference(cnf_transformation,[],[f36])).
0.13/0.41	thf(f36,plain,(
0.13/0.41	  (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))),
0.13/0.41	  inference(fool_elimination,[],[f35])).
0.13/0.41	thf(f35,plain,(
0.13/0.41	  (intersection = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) & (X1 @ X2))))),
0.13/0.41	  inference(rectify,[],[f8])).
0.13/0.41	thf(f8,axiom,(
0.13/0.41	  (intersection = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) & (X2 @ X3))))),
0.13/0.41	  file('/export/starexec/sandbox/tmp/tmp.q5tcqzQUFS/E---3.1_30255.p',intersection)).
0.13/0.41	thf(f90,plain,(
0.13/0.41	  (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))))),
0.13/0.41	  inference(cnf_transformation,[],[f42])).
0.13/0.41	thf(f42,plain,(
0.13/0.41	  (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))))),
0.13/0.41	  inference(fool_elimination,[],[f41])).
0.13/0.41	thf(f41,plain,(
0.13/0.41	  ((^[X0 : $i > $i, X1 : $i > $o, X2 : $i] : (? [X3] : ((X1 @ X3) & ((X0 @ X3) = X2)))) = fun_image)),
0.13/0.41	  inference(rectify,[],[f15])).
0.13/0.41	thf(f15,axiom,(
0.13/0.41	  ((^[X4 : $i > $i, X5 : $i > $o, X2 : $i] : (? [X0] : ((X5 @ X0) & ((X4 @ X0) = X2)))) = fun_image)),
0.13/0.41	  file('/export/starexec/sandbox/tmp/tmp.q5tcqzQUFS/E---3.1_30255.p',fun_image)).
0.13/0.41	thf(f93,plain,(
0.13/0.41	  (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
0.13/0.41	  inference(cnf_transformation,[],[f27])).
0.13/0.41	thf(f27,plain,(
0.13/0.41	  (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
0.13/0.41	  inference(fool_elimination,[],[f26])).
0.13/0.41	thf(f26,plain,(
0.13/0.41	  (subset = (^[X0 : $i > $o, X1 : $i > $o] : (! [X2] : ((X0 @ X2) => (X1 @ X2)))))),
0.13/0.41	  inference(rectify,[],[f12])).
0.13/0.41	thf(f12,axiom,(
0.13/0.41	  (subset = (^[X0 : $i > $o, X2 : $i > $o] : (! [X3] : ((X0 @ X3) => (X2 @ X3)))))),
0.13/0.41	  file('/export/starexec/sandbox/tmp/tmp.q5tcqzQUFS/E---3.1_30255.p',subset)).
0.13/0.41	thf(f88,plain,(
0.13/0.41	  ((subset @ (fun_image @ sK1 @ (intersection @ sK2 @ sK0)) @ (intersection @ (fun_image @ sK1 @ sK2) @ (fun_image @ sK1 @ sK0))) != $true)),
0.13/0.41	  inference(cnf_transformation,[],[f71])).
0.13/0.41	thf(f71,plain,(
0.13/0.41	  ((subset @ (fun_image @ sK1 @ (intersection @ sK2 @ sK0)) @ (intersection @ (fun_image @ sK1 @ sK2) @ (fun_image @ sK1 @ sK0))) != $true)),
0.13/0.41	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f69,f70])).
0.13/0.41	thf(f70,plain,(
0.13/0.41	  ? [X0 : $i > $o,X1 : $i > $i,X2 : $i > $o] : ((subset @ (fun_image @ X1 @ (intersection @ X2 @ X0)) @ (intersection @ (fun_image @ X1 @ X2) @ (fun_image @ X1 @ X0))) != $true) => ((subset @ (fun_image @ sK1 @ (intersection @ sK2 @ sK0)) @ (intersection @ (fun_image @ sK1 @ sK2) @ (fun_image @ sK1 @ sK0))) != $true)),
0.13/0.41	  introduced(choice_axiom,[])).
0.13/0.41	thf(f69,plain,(
0.13/0.41	  ? [X0 : $i > $o,X1 : $i > $i,X2 : $i > $o] : ((subset @ (fun_image @ X1 @ (intersection @ X2 @ X0)) @ (intersection @ (fun_image @ X1 @ X2) @ (fun_image @ X1 @ X0))) != $true)),
0.13/0.41	  inference(ennf_transformation,[],[f38])).
0.13/0.41	thf(f38,plain,(
0.13/0.41	  ~! [X0 : $i > $o,X1 : $i > $i,X2 : $i > $o] : ((subset @ (fun_image @ X1 @ (intersection @ X2 @ X0)) @ (intersection @ (fun_image @ X1 @ X2) @ (fun_image @ X1 @ X0))) = $true)),
0.13/0.41	  inference(fool_elimination,[],[f37])).
0.13/0.41	thf(f37,plain,(
0.13/0.41	  ~! [X0 : $i > $o,X1 : $i > $i,X2 : $i > $o] : (subset @ (fun_image @ X1 @ (intersection @ X2 @ X0)) @ (intersection @ (fun_image @ X1 @ X2) @ (fun_image @ X1 @ X0)))),
0.13/0.41	  inference(rectify,[],[f24])).
0.13/0.41	thf(f24,negated_conjecture,(
0.13/0.41	  ~! [X2 : $i > $o,X4 : $i > $i,X0 : $i > $o] : (subset @ (fun_image @ X4 @ (intersection @ X0 @ X2)) @ (intersection @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
0.13/0.41	  inference(negated_conjecture,[],[f23])).
0.13/0.41	thf(f23,conjecture,(
0.13/0.41	  ! [X2 : $i > $o,X4 : $i > $i,X0 : $i > $o] : (subset @ (fun_image @ X4 @ (intersection @ X0 @ X2)) @ (intersection @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
0.13/0.41	  file('/export/starexec/sandbox/tmp/tmp.q5tcqzQUFS/E---3.1_30255.p',thm)).
0.13/0.41	thf(f121,plain,(
0.13/0.41	  ( ! [X1 : $i] : (((sK1 @ X1) != sK4) | ((sK2 @ X1) = $false)) ) | ~spl3_1),
0.13/0.41	  inference(avatar_component_clause,[],[f120])).
0.13/0.41	thf(f120,plain,(
0.13/0.41	  spl3_1 <=> ! [X1] : (((sK1 @ X1) != sK4) | ((sK2 @ X1) = $false))),
0.13/0.41	  introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
0.13/0.41	thf(f108,plain,(
0.13/0.41	  ($true = (sK2 @ sK5))),
0.13/0.41	  inference(binary_proxy_clausification,[],[f105])).
0.13/0.41	thf(f105,plain,(
0.13/0.41	  ($true = ((sK0 @ sK5) & (sK2 @ sK5)))),
0.13/0.41	  inference(binary_proxy_clausification,[],[f104])).
0.13/0.41	thf(f130,plain,(
0.13/0.41	  ~spl3_2),
0.13/0.41	  inference(avatar_contradiction_clause,[],[f129])).
0.13/0.41	thf(f129,plain,(
0.13/0.41	  $false | ~spl3_2),
0.13/0.41	  inference(trivial_inequality_removal,[],[f128])).
0.13/0.41	thf(f128,plain,(
0.13/0.41	  ($true = $false) | ~spl3_2),
0.13/0.41	  inference(backward_demodulation,[],[f109,f127])).
0.13/0.41	thf(f127,plain,(
0.13/0.41	  ((sK0 @ sK5) = $false) | ~spl3_2),
0.13/0.41	  inference(trivial_inequality_removal,[],[f126])).
0.13/0.41	thf(f126,plain,(
0.13/0.41	  ((sK0 @ sK5) = $false) | (sK4 != sK4) | ~spl3_2),
0.13/0.41	  inference(superposition,[],[f124,f107])).
0.13/0.41	thf(f124,plain,(
0.13/0.41	  ( ! [X2 : $i] : (((sK1 @ X2) != sK4) | ((sK0 @ X2) = $false)) ) | ~spl3_2),
0.13/0.41	  inference(avatar_component_clause,[],[f123])).
0.13/0.41	thf(f123,plain,(
0.13/0.41	  spl3_2 <=> ! [X2] : (((sK0 @ X2) = $false) | ((sK1 @ X2) != sK4))),
0.13/0.41	  introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
0.13/0.41	thf(f109,plain,(
0.13/0.41	  ((sK0 @ sK5) = $true)),
0.13/0.41	  inference(binary_proxy_clausification,[],[f105])).
0.13/0.41	thf(f125,plain,(
0.13/0.41	  spl3_1 | spl3_2),
0.13/0.41	  inference(avatar_split_clause,[],[f118,f123,f120])).
0.13/0.41	thf(f118,plain,(
0.13/0.41	  ( ! [X2 : $i,X1 : $i] : (((sK1 @ X1) != sK4) | ((sK2 @ X1) = $false) | ((sK0 @ X2) = $false) | ((sK1 @ X2) != sK4)) )),
0.13/0.41	  inference(equality_proxy_clausification,[],[f117])).
0.13/0.41	thf(f117,plain,(
0.13/0.41	  ( ! [X2 : $i,X1 : $i] : (((sK0 @ X2) = $false) | ((sK2 @ X1) = $false) | ((sK1 @ X2) != sK4) | (((sK1 @ X1) = sK4) = $false)) )),
0.13/0.41	  inference(equality_proxy_clausification,[],[f116])).
0.13/0.41	thf(f116,plain,(
0.13/0.41	  ( ! [X2 : $i,X1 : $i] : (($false = ((sK1 @ X2) = sK4)) | (((sK1 @ X1) = sK4) = $false) | ((sK2 @ X1) = $false) | ((sK0 @ X2) = $false)) )),
0.13/0.41	  inference(binary_proxy_clausification,[],[f115])).
0.13/0.41	thf(f115,plain,(
0.13/0.41	  ( ! [X2 : $i,X1 : $i] : (((sK2 @ X1) = $false) | ((((sK1 @ X2) = sK4) & (sK0 @ X2)) = $false) | (((sK1 @ X1) = sK4) = $false)) )),
0.13/0.41	  inference(beta_eta_normalization,[],[f114])).
0.13/0.41	thf(f114,plain,(
0.13/0.41	  ( ! [X2 : $i,X1 : $i] : ((((sK1 @ X1) = sK4) = $false) | ((sK2 @ X1) = $false) | (((^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK0 @ Y0))) @ X2) = $false)) )),
0.13/0.41	  inference(pi_clausification,[],[f113])).
0.13/0.41	thf(f113,plain,(
0.13/0.41	  ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK0 @ Y0)))) = $false) | (((sK1 @ X1) = sK4) = $false) | ((sK2 @ X1) = $false)) )),
0.13/0.41	  inference(binary_proxy_clausification,[],[f112])).
0.13/0.41	thf(f112,plain,(
0.13/0.41	  ( ! [X1 : $i] : (((((sK1 @ X1) = sK4) & (sK2 @ X1)) = $false) | ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK0 @ Y0)))) = $false)) )),
0.13/0.41	  inference(beta_eta_normalization,[],[f111])).
0.13/0.41	thf(f111,plain,(
0.13/0.41	  ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK0 @ Y0)))) = $false) | (((^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK2 @ Y0))) @ X1) = $false)) )),
0.13/0.41	  inference(pi_clausification,[],[f110])).
0.13/0.41	thf(f110,plain,(
0.13/0.41	  ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK2 @ Y0)))) = $false) | ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK0 @ Y0)))) = $false)),
0.13/0.41	  inference(binary_proxy_clausification,[],[f101])).
0.13/0.41	thf(f101,plain,(
0.13/0.41	  (((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK0 @ Y0)))) & (?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) = sK4) & (sK2 @ Y0))))) = $false)),
0.13/0.41	  inference(binary_proxy_clausification,[],[f100])).
0.13/0.41	% SZS output end Proof for E---3.1_30255
0.13/0.41	% (30501)------------------------------
0.13/0.41	% (30501)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.13/0.41	% (30501)Termination reason: Refutation
0.13/0.41	
0.13/0.41	% (30501)Memory used [KB]: 5628
0.13/0.41	% (30501)Time elapsed: 0.009 s
0.13/0.41	% (30501)Instructions burned: 8 (million)
0.13/0.41	% (30501)------------------------------
0.13/0.41	% (30501)------------------------------
0.13/0.41	% (30494)Success in time 0.024 s
0.13/0.41	EOF